Theory and Practice of Non-Binary Graph-Based Codes: A Combinatorial View

نویسنده

  • Behzad Amiri
چکیده

OF THE DISSERTATION Theory and Practice of Non-Binary Graph-Based Codes: A Combinatorial View

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Just chromatic exellence in fuzzy graphs

A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...

متن کامل

The (non-)existence of perfect codes in Lucas cubes

A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...

متن کامل

THIN WALLED STEEL SECTIONS’ FREE SHAPE OPTIMIZATION USING CHARGED SYSTEM SEARCH ALGORITHM

Graph theory based methods are powerful means for representing structural systems so that their geometry and topology can be understood clearly. The combination of graph theory based methods and some metaheuristics can offer effective solutions for complex engineering optimization problems. This paper presents a Charged System Search (CSS) algorithm for the free shape optimizations of thin-wall...

متن کامل

Construction and Performance Analysis of BIBD-QC-LDPC Codes for Correcting Erasure-Bursts

This paper presents a novel approach for constructing structured regular QC-LDPC codes based on a special type of combinatorial designs,known as the balanced incomplete block design (BIBD).The code design approach based on the technology of block cyclic shift and dispertion (BCSD) for correcting erasure-bursts over the binary bursts erasure channel (BBEC). Furthermore, the Tanner graph of the c...

متن کامل

Perfect codes and related topics

The topic of perfect codes is one of the most important topics in the theory of error-correcting codes. The class of perfect codes is very complicated, large (double exponential) and intensively studied by many researches. The investigation of nontrivial properties of perfect codes is significant both from coding point of view (for the solution of the classification problem for such codes) and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015